Developments in ROOT I/O and trees
نویسندگان
چکیده
For the last several months the main focus of development in the ROOT I/O package has been code consolidation and performance improvements. We introduced a new pre-fetch mechanism to minimize the number of transactions between client and server, hence reducing the effect of latency on the time it takes to read a file both locally and over wide are network. We will review the implementation and how well it works in different conditions (gain of an order of magnitude for remote file access). We will also briefly describe new utilities, including a faster implementation of TTree cloning (gain of an order of magnitude), a generic mechanism for object references, and a new entry list mechanism tuned both for small and large number of selections. In addition to reducing the coupling with the core module and becoming its owns library (libRIO) (as part of the general restructuring of the ROOT libraries), the I/O package has been enhanced in the area of XML and SQL support, thread safety, schema evolution, tree queries, and many other areas. 1. ROOT I/O History ROOT I/O has been at the core of ROOT since its inception and has continually improved for 12 years. This is brief review of the major enhancements. In earlier version, the I/O was requiring the user to modify its code and was using a streamer function either automatically generated or hand coded when schema evolution was required. In 2001, we introduced support for Automatic schema evolution using the CINT dictionary information to completely drive the I/O and introduced a reference type (TRef). In 2002 and 2003 we lifted all the requirements of the user classes to be instrumented and extended all the I/O API accordingly. Since 2005 ROOT allows for files with a size larger than 2 GB. Also the compression capabilities of the I/O system for floating point umbers were improved. In 2006, we extended the TRef to work seamlessly and more efficiently with our drawing tools and improved performance over wide area networks by introducing automatic prefetching.
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملبررسی زندهمانی و رشد درختان کاج و چنار منتقل شده بر اساس کاربرد هورمون IBA، سن درخت، زمان و نحوه انتقال
The major problems in transplanting the landscape trees are high level of mortality and low establishment rate of transplanted trees, especially in the first year. In order to achieve the best condition for successful transplanting of pine and plane trees in Isfahan landscape, the present study was carried out based on a completely randomized block design with four replicates and three treatmen...
متن کاملEvaluation of the morphological Characteristics of broadleaf and needle leaf old trees for Use in Reforestation of forests in Ilam Province
Old trees as the most important genetic reserves of the country have great importance and value in various aspects of ecology, forest restoration management, ecotourism and even history. In this research, after identification of the old trees in the forests of Ilam province, their morphological characteristics including DBH, trunk height, total height, crown length, min & max crown diameter, cr...
متن کاملResearch Trench Inserts as Long-term Barriers to Root Transmission for Control of Oak Wilt
Wilson, A. D., and Lester, D. Ci. 2002. Trench inserts as long-term barriers to root transmission for control of oak wilt. Plant Dis. 86: 1067-1074. Physical and chemical barriers to root penetration and root grafting across trenches were evaluated for their effectiveness in improving trenches as barriers to root transmission of the oak wilt fungus in live oaks. Four trench insert materials wer...
متن کاملVarieties of Increasing
---~Y(z) = ~(Y(z)), which is non linear and autonomous. Singularity analysis applied to the intervening generating functions then permits to analyze asymptotically a number of parameters of the trees, like: root degree, number of leaves, path length, and level of nodes. In this way it is found that various models share common features: path length is O(n log n), the distribution of node levels ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0901.0886 شماره
صفحات -
تاریخ انتشار 2008